Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
نویسندگان
چکیده
منابع مشابه
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also known as information reconciliation and privacy amplification over unsecured channels, was shown to be theoretically feasible by Renner and Wolf (Eurocrypt 2004), although no protocol that runs in polynomial time was d...
متن کاملA Robust Authenticated Key Agreement Protocol
In this paper, we propose a robust authenticated key agreement protocol in which two communication parties exchange a secret session key and authenticate each other. The protocol can be considered as an improvement of simple authenticated key agreement algorithm (SAKA). However, our protocol is more significant in that it addresses the problem of the off-line password guessing attack.
متن کاملIdentity Based Authenticated Key Agreement from Pairings
We present a new identity based authenticated key agreement protocol from pairings satisfying the required security attributes. The security of our protocol is based on the bilinear Diffie-Hellman assumption.
متن کاملTripartite Authenticated Key Agreement Protocols from Pairings
Joux’s protocol [29] is a one round, tripartite key agreement protocol that is more bandwidth-efficient than any previous three-party key agreement protocol. But it is insecure, suffering from a simple man-inthe-middle attack. This paper shows how to make Joux’s protocol secure, presenting several tripartite, authenticated key agreement protocols that still require only one round of communicati...
متن کاملStrongly Robust Fuzzy Extractors
Fuzzy extractors are used to generate reliably reproducible randomness from a biased, noisy source. Known constructions of fuzzy extractors are built from a strong extractor, and a secure sketch, a function that transforms a biased noisy secret value into a public value, simultaneously hiding the secret and allowing for error correction. A robust sketch is secure against adversarial modificatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2200290